منابع مشابه
A binary search problem on graphs
Franzkeit, R., A binary search problem on graphs, Discrete Applied Mathematics 36 (1992) 83-86. Let G = (V, E) be a graph and e’~ E an unknown edge. I:, order to find e’ we choose a sequence of test sets WC V, where aftev every test we are told whether both vertices incident to e’ are in W, or not. For C(Gj, L,,~ Aminimum number of tests required, the inequality c(G)? rlogz 1~11 clearly holds (...
متن کاملBinary Search in Graphs Revisited
In the classical binary search in a path the aim is to detect an unknown target by asking as few queries as possible, where each query reveals the direction to the target. This binary search algorithm has been recently extended by [Emamjomeh-Zadeh et al., STOC, 2016] to the problem of detecting a target in an arbitrary graph. Similarly to the classical case in the path, the algorithm of Emamjom...
متن کاملNote on a Helicopter Search Problem on Graphs
We consider a search game on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the invisible robber. The existence of the winning program for the cop in this problem depends only on the robber’s speed. We investigate the problem of finding the minimal robber’s speed which prevents the cop from winning. For this parameter we give tight bounds in terms of the li...
متن کاملOn the Search Path Length of Random Binary Skip Graphs
In this paper we consider the skip graph data structure, a load balancing alternative to skip lists, designed to perform better in a distributed environment. We extend previous results of Devroye on skip lists, and prove that the maximum length of a search path in a random binary skip graph of size n is of order logn with high probability.
متن کاملA Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem
T paper presents a binary search heuristic algorithm for the rectangular strip-packing problem. The problem is to pack a number of rectangles into a sheet of given width and infinite height so as to minimize the required height. We first transform this optimization problem into a decision problem. A least-waste-first strategy and a minimal-inflexion-first strategy are proposed to solve the rela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90207-q